Towards a flexible hybrid planner for machine coordination in arable farming
نویسندگان
چکیده
In this paper we propose a new approach to coordinate multiple machines in the grain harvesting process, based on meta-constraint reasoning. This way we obtain more flexible plans that can be adapted at execution time. As an example scenario we focus on silage maize harvesting. We argue that more sophisticated flexible planning mechanisms are needed in order to obtain flexible plans that can be adapted at runtime to changing parameters such as yield per area.
منابع مشابه
A hybrid algorithm optimization approach for machine loading problem in flexible manufacturing system
The production planning problem of flexible manufacturing system (FMS) concerns with decisions that have to be made before an FMS begins to produce parts according to a given production plan during an upcoming planning horizon. The main aspect of production planning deals with machine loading problem in which selection of a subset of jobs to be manufactured and assignment of their operations to...
متن کاملA Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints
This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regardi...
متن کاملA Computerised Decision Making Aid for Environmental Management in Arable Agriculture
In the past the environmental consequences of arable agriculture were often accepted without question. However, there is now increasing debate and public concern regarding the short and long term environmental impacts that might occur as a result of farming practices. Concern, within arable agriculture, is especially focused towards the over-ambitious use of fertilisers and the consequence of n...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کامل